Nonlinear spread of rumor and inoculation strategies in the nodes with degree dependent tie strength in complex networks
نویسندگان
چکیده
In the classic rumor spreading model, also known as susceptible-infectedremoved (SIR) model in which rumor spread out of each node proportionally to its degree and all edges have uniform tie strength between nodes. The rumor spread phenomenon is similar as epidemic spread, in which all the informed nodes spread rumor by informing their neighbor nodes. In earlier rumor spreading models, at each time step nodes contact all of their neighbors. In more realistic scenario it is possible that a node may contact only some of its neighbors to spread the rumor. Therefore it is must in real world complex networks, the classic rumor spreading model need to be modified to consider the dependence of rumor spread rate on the degree of the spreader and the informed nodes. We have given a modified rumor spreading model to accommodate these facts. This new model, has been studied for rumor spreading in complex networks in this work. Rumor spreads nonlinearly by pairwise contacts between nodes in complex networks at degree dependent spreading rate. Nonlinear rumor spread exponent α and degree dependent tie strength of nodes affect the rumor threshold. The degree exponent tie strength between two nodes is (kikj) β, where ki and kj are degrees of node i and j and β is tie strength exponent. By using the above two exponents in any complex network gives rumor threshold as some finite value. In the present work, the modified rumor spreading model has been studied in scale free networks. It has been found to have a greater threshold than with previous classic rumor spreading model. It is also found that if α and β parameters are tuned to appropriate value, the rumor threshold becomes independent of network size. In any social network, rumors can spread may have undesirable effect. One 1 of the possible solutions to control rumor spread, is to inoculate a certain fraction of nodes against rumors. The inoculation can be done randomly or in a targeted fashion. We have used modified rumor spreading model over scale free networks to investigate the efficacy of inoculation. Random and targeted inoculation schemes have been applied. It has been observed that rumor threshold in random inoculation scheme is greater than the rumor threshold in the model without any inoculation scheme. But random inoculation is not that much effective. The rumor threshold in targeted inoculation is very high than the rumor threshold in the random inoculation in suppressing the rumor. It has also been observed that targeted inoculation scheme is more successful to stop the rumor in this model based on scale free networks. The proposed hypothesis is also verified by simulation results.
منابع مشابه
A computational model and convergence theorem for rumor dissemination in social networks
The spread of rumors, which are known as unverified statements of uncertain origin, may threaten the society and it's controlling, is important for national security councils of countries. If it would be possible to identify factors affecting spreading a rumor (such as agents’ desires, trust network, etc.) then, this could be used to slow down or stop its spreading. Therefore, a computational m...
متن کاملSynchronization criteria for T-S fuzzy singular complex dynamical networks with Markovian jumping parameters and mixed time-varying delays using pinning control
In this paper, we are discuss about the issue of synchronization for singular complex dynamical networks with Markovian jumping parameters and additive time-varying delays through pinning control by Takagi-Sugeno (T-S) fuzzy theory.The complex dynamical systems consist of m nodes and the systems switch from one mode to another, a Markovian chain with glorious transition probabili...
متن کاملA Fast Approach to the Detection of All-Purpose Hubs in Complex Networks with Chemical Applications
A novel algorithm for the fast detection of hubs in chemical networks is presented. The algorithm identifies a set of nodes in the network as most significant, aimed to be the most effective points of distribution for fast, widespread coverage throughout the system. We show that our hubs have in general greater closeness centrality and betweenness centrality than vertices with maximal degree, w...
متن کاملThe Influence of Location on Nodes’ Centrality in Location-Based Social Networks
Nowadays, due to the widespread use of social networks, they can be used as a convenient, low-cost, and affordable tool for disseminating all kinds of information and data among the massive users of these networks. Issues such as marketing for new products, informing the public in critical situations, and disseminating medical and technological innovations are topics that have been considered b...
متن کاملRumor Spreading and Degree-Related Preference Mechanism on a Small-World Network
An alternate model for rumor spreading over small-world networks is suggested, of which two rumors (termed rumor 1 and rumor 2) have different nodes and probabilities of acceptance. The propagation is not symmetric in the sense that when deciding which rumor to adopt, high-degree nodes always consider rumor 1 first, and low-degree nodes always consider rumor 2 first. The model is a natural gene...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1208.6063 شماره
صفحات -
تاریخ انتشار 2012